Pixel-Correct Shadow Maps with Temporal Reprojection and Shadow Test Confidence

نویسندگان

  • Daniel Scherzer
  • Stefan Jeschke
  • Michael Wimmer
چکیده

Shadow mapping suffers from spatial aliasing (visible as blocky shadows) as well as temporal aliasing (visible as flickering). Several methods have already been proposed for reducing such artifacts, but so far none is able to provide satisfying results in real time. This paper extends shadow mapping by reusing information of previously rasterized images, stored efficiently in a so-called history buffer. This buffer is updated in every frame and then used for the shadow calculation. In combination with a special confidence-based method for the history buffer update (based on the current shadow map), temporal and spatial aliasing can be completely removed. The algorithm converges in about 10 to 60 frames and during convergence, shadow borders are sharpened over time. Consequently, in case of real-time frame rates, the temporal shadow adaption is practically imperceptible. The method is simple to implement and is as fast as uniform shadow mapping, incurring only the minor speed hit of the history buffer update. It works together with advanced filtering methods like percentage closer filtering and more advanced shadow mapping techniques like perspective or light space perspective shadow maps.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pixel Accurate Shadows with Shadow Mapping

Shadow mapping is a popular technique for shadow generation. However, it is still a difficult problem to generate high quality shadows in real time framerates for arbirary scenes. This work summarizes state-of-the-art techniques to achieve pixel accurate shadows and points out the various problems of generating artifact free shadows. Furthermore, we present a new technique that uses multiple ji...

متن کامل

Chapter 6 The Real - Time Reprojection Cache

Real-time pixel shading techniques have become increasingly complex, and consume an ever larger share of the graphics processing budget in applications such as games. This has driven the development of optimization techniques that either attempt to simplify pixel shaders, or to cull their evaluation when possible. In this chapter, we follow an alternative strategy: reducing the number of shadin...

متن کامل

Interpolation-Friendly Soft Shadow Maps

We present Penumbra Limit Maps, a technique for rendering soft shadows from a modified shadow map. The shadow representation used by our method has excellent interpolation properties, allowing the shadow boundary to be rendered with sub shadowmap-pixel accuracy, which partially mitigates the resolution problems common to shadow map methods. Unlike similar shadow map methods, our method includes...

متن کامل

Fast Robust and Precise Shadow Algorithm for WebGL 1.0 Platform

This paper presents fast and robust per-sample correct shadows for WebGL platform. The algorithm is based on silhouette shadow volumes and it rivals the standard shadow mapping performance. Our performance is usually superior when compared with high resolution shadow maps. Moreover, it does not suffer from a number of artefacts of shadow mapping and always provides per-pixel correct results. We...

متن کامل

Shadow Map Optimization

The following article formulates the optimization problem for shadow maps without providing any good answer to the problem. For our purpose, a shadow map is a rasterized image of depth information for a scene from a light's perspective. The map is used in rendering to test if a given pixel is visible with respect to a light source. An overview of the method is provided in Algorithm 1.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007